On self-reducibility and weak P-selectivity
نویسندگان
چکیده
منابع مشابه
Selectivity and Self - Reducibility : NewCharacterizations of Complexity
It is known that a set is in P ii it is p-time Turing self-reducible and p-selective 2] and a p-time Turing self-reducible set is in NP \ coNP ii it is NP-selective 4]. We generalize these new characterizations to arbitrary time complexity classes. A simple and direct proof for the result of 2] is obtained. Probabilistic selectivity is also studied.
متن کاملComputable Fields and Weak Truth-Table Reducibility
For a computable field F , the splitting set SF of F is the set of polynomials with coefficients in F which factor over F , and the root set RF of F is the set of polynomials with coefficients in F which have a root in F . Results of Frohlich and Shepherdson in [3] imply that for a computable field F , the splitting set SF and the root set RF are Turing-equivalent. Much more recently, in [6], M...
متن کاملP-immune sets with holes lack self-reducibility properties
No P-immune set having exponential gaps is positive-Turing self-reducible.
متن کاملOn Coherence, Random-self-reducibility, and Self-correction1
We address two questions about self-reducibility the power of adaptiveness in examiners that take advice and the relationship between random-self-reducibility and self-correctability. We rst show that adaptive examiners are more powerful than nonadaptive examiners, even if the nonadaptive ones are nonuniform: There exists a coherent function that is not nonadaptively coherent, even via nonadapt...
متن کاملOn P-selectivity and Closeness
P/poly, the class of sets with polynomial size circuits, has been the subject of considerable study in complexity theory. Two important subclasses of P/poly are the class of sparse sets 6] and the class of P-selective sets 31]. A large number of results have been proved about both these classes but it has been observed (for example, 17]) that despite their similarity, proofs about one class gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1983
ISSN: 0022-0000
DOI: 10.1016/0022-0000(83)90013-2